Colorful Paths in Vertex Coloring of Graphs
نویسندگان
چکیده
منابع مشابه
Colorful Paths in Vertex Coloring of Graphs
A colorful path in a graph G is a path with χ(G) vertices whose colors are different. A vcolorful path is such a path, starting from v. Let G 6= C7 be a connected graph with maximum degree ∆(G). We show that there exists a (∆(G) + 1)-coloring of G with a v-colorful path for every v ∈ V (G). We also prove that this result is true if one replaces (∆(G) + 1) colors with 2χ(G) colors. If χ(G) = ω(G...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملon the complexity of the colorful directed paths in vertex coloring of digraphs
the colorful paths and rainbow paths have been considered by severalauthors.a colorful directed path in a digraph $g$ is a directed path with $chi(g)$ vertices whose colors are different. a $v$-colorful directed path is such a directed path, starting from $v$. we prove that for a given $3$-regular triangle-free digraph $g$ determining whether there is a proper $chi(g)$-coloring of $g$such that ...
متن کاملColorful paths for 3-chromatic graphs
In this paper, we prove that every 3-chromatic connected graph, except C7, admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path. It is a special case of a conjecture due to S. Akbari, F. Khaghanpoor, and S. Moazzeni, cited in [P.J. Cameron, Research problems from the BCC22, Discrete Math. 311 (2011), 1074–1083], stating that every connected graph G other than ...
متن کاملTotal Coloring of Certain Double Vertex Graphs
In this paper we investigate the total coloring number for double vertex graphs of some of the most common classes of graphs. Mathematics Subject Classification: 05C15
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/504